Intensional Sets in CLP

Dealing with Infinite Intensional Sets in CLP

Very often a set S is denoted intensionally, that is by providing a condition φ that is necessary and sufficient for an element X to belong to S. This paper addresses the problem of embedding intensional sets into a CLP language which offers extensional sets and a few basic operations on them (namely, =, ∈, and their negative counterparts). We consider the translation-based technique used in {l...

Intensional Set Constraints

Existing approaches to deal with sets in a CLP framework generally assume the niteness of the subjacent sets: that is a reason why intensional sets are often forbidden. In this paper, we propose a new compilation method to treat intensional sets in a general setting. Our representation relies on a simply typed-calculus: sets are considered as Boolean-valued functions that may involve union and ...

Dealing with In nite Intensional Sets in CLP

Compiling Intensional Sets in CLP

Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an ‘active’ role. In this paper we analyze an extension of the original constructive negation in order to gracefully integrate with the management of set-constraints in the context of a Constraint Logic Programming Language dealing with finite sets. W...

A Language with Finite Sets Embedded in the CLP-scheme

Problems and solutions related to the introduction of finite set formers and basic operations on sets in a Logic Programming language are discussed. In particular it is shown that a good solution is to begin with a CLP-scheme whose signature Σ is endowed with two functional symbols: ∅ for the empty set and with for the set construction symbol , using the symbols ∈, 6∈, =, 6= as constraint predi...